Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое multiple recursion - определение
METHOD IN COMPUTER SCIENCE
Recursive algorithm; Recursive loop; Recursion termination; Recursive call; Recursive calls; Recursive (computer science); Arm's-length recursion; Direct recursion; Indirect recursion; Single recursion; Multiple recursion; Generative recursion; Recursive limit; Recursion(computer science); Recursive function (programming); Termination of recursive functions; Depth of recursion; User:Seemplez/sandbox/sandbox
Найдено результатов: 835
Multiple abnormalities
CONGENITAL ABNORMALITIES THAT AFFECT MORE THAN ONE ORGAN OR BODY STRUCTURE
Multiple congenital malformations; Multiple congenital anomalies
When a patient has multiple abnormalities (multiple anomaly, multiple deformity), they have a congenital abnormality that can not be primarily identified with a single system of the body or single disease process. Most medical conditions can have systemic sequelae, but multiple abnormalities occur when the effects on multiple systems is immediately obvious.
multiple unit
![A double decker [[Sydney Trains B set]]](https://commons.wikimedia.org/wiki/Special:FilePath/B set departing Panania 20180919 01 (Nimed).jpg?width=200 "A double decker [[Sydney Trains B set]]")
![River Line]]](https://commons.wikimedia.org/wiki/Special:FilePath/Gtw riverline.JPG?width=200 "River Line]]")
![Perth]] and the mining town of [[Kalgoorlie]] in [[Australia]].](https://commons.wikimedia.org/wiki/Special:FilePath/Prospector new railcar, Toodyay.jpg?width=200 "Perth]] and the mining town of [[Kalgoorlie]] in [[Australia]].")
![Elektrichka on [[Yaroslavskiy Rail Terminal]], Moscow](https://commons.wikimedia.org/wiki/Special:FilePath/RZD ED4M-0103 Moskva-Yaroslavskaya.jpg?width=200 "Elektrichka on [[Yaroslavskiy Rail Terminal]], Moscow")
![RABe 523]] is the most common multiple units on Switzerland, used by almost every S-Bahn.](https://commons.wikimedia.org/wiki/Special:FilePath/SBB RABe 523 FLIRT der Zuger S-Bahn.jpg?width=200 "RABe 523]] is the most common multiple units on Switzerland, used by almost every S-Bahn.")
![A [[N700 Series Shinkansen]] set in June 2008](https://commons.wikimedia.org/wiki/Special:FilePath/Shinkansen N700 z15.jpg?width=200 "A [[N700 Series Shinkansen]] set in June 2008")
![Simon's Town station]], [[Cape Town]]](https://commons.wikimedia.org/wiki/Special:FilePath/Wikimania 2018, Cape Town (P1050609).jpg?width=200 "Simon's Town station]], [[Cape Town]]")
TYPE OF TRAIN CONSISTING OF SELF-PROPELLED CARRIAGES CAPABLE OF COUPLING WITH OTHERS OF THE SAME OR SIMILAR TYPE
Multiple units; Multiple-unit; Self-powered; Motorized unit; Self-powered car; Multi-unit; Electric mutliple unit; Multiple Units; Multiple-unit car; Multiple Unit; Freight multiple unit; Multiple-unit operation; Multiple unit train; Multiple-Unit
¦ noun a passenger train of two or more carriages powered by integral motors which drive a number of axles.
Tail call
SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION
Tail recursion; Tail recursion modulo cons; Tail-recursive; Tail recursive; Tail call optimization; Tail Recursion; Tail-call optimization; Tailcall; Tail-call optimisation; Tail-call elimination; Tail-recursion; Tail-end recursion; Tail call elimination; Tail recursion elimination; Tail recursion optimization; Tail-recursion optimization; Proper tail recursion; Tail function; Tail recursive function; Tail-recursive function
In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion.
tail recursion
SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION
Tail recursion; Tail recursion modulo cons; Tail-recursive; Tail recursive; Tail call optimization; Tail Recursion; Tail-call optimization; Tailcall; Tail-call optimisation; Tail-call elimination; Tail-recursion; Tail-end recursion; Tail call elimination; Tail recursion elimination; Tail recursion optimization; Tail-recursion optimization; Proper tail recursion; Tail function; Tail recursive function; Tail-recursive function
<programming> When the last thing a function (or procedure)
does is to call itself. Such a function is called tail
recursive. A function may make several recursive calls but
a call is only tail-recursive if the caller returns
immediately after it. E.g.
f n = if n < 2 then 1 else f (f (n-2) + 1)
In this example both calls to f are recursive but only the
outer one is tail recursive.
Tail recursion is a useful property because it enables {tail
recursion optimisation}.
If you aren't sick of them already, see recursion and {tail
recursion}.
[Jargon File ]
(2006-04-16)
Multiple unit
TYPE OF TRAIN CONSISTING OF SELF-PROPELLED CARRIAGES CAPABLE OF COUPLING WITH OTHERS OF THE SAME OR SIMILAR TYPE
Multiple units; Multiple-unit; Self-powered; Motorized unit; Self-powered car; Multi-unit; Electric mutliple unit; Multiple Units; Multiple-unit car; Multiple Unit; Freight multiple unit; Multiple-unit operation; Multiple unit train; Multiple-Unit
A multiple-unit train or simply multiple unit (MU) is a self-propelled train composed of one or more carriages joined together, which when coupled to another multiple unit can be controlled by a single driver, with multiple-unit train control.
tail call optimization
SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION
Tail recursion; Tail recursion modulo cons; Tail-recursive; Tail recursive; Tail call optimization; Tail Recursion; Tail-call optimization; Tailcall; Tail-call optimisation; Tail-call elimination; Tail-recursion; Tail-end recursion; Tail call elimination; Tail recursion elimination; Tail recursion optimization; Tail-recursion optimization; Proper tail recursion; Tail function; Tail recursive function; Tail-recursive function
tail recursion modulo cons
SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION
Tail recursion; Tail recursion modulo cons; Tail-recursive; Tail recursive; Tail call optimization; Tail Recursion; Tail-call optimization; Tailcall; Tail-call optimisation; Tail-call elimination; Tail-recursion; Tail-end recursion; Tail call elimination; Tail recursion elimination; Tail recursion optimization; Tail-recursion optimization; Proper tail recursion; Tail function; Tail recursive function; Tail-recursive function
<programming, compiler> A generalisation of tail recursion
introduced by D.H.D. Warren. It applies when the last thing a
function does is to apply a constructor functions (e.g. cons)
to an application of a non-primitive function. This is
transformed into a tail call to the function which is also
passed a pointer to where its result should be written. E.g.
f [D.H.D. Warren, DAI Research Report 141, University of
Edinburgh 1980 ].
(1995-03-06)
recursive
![Malyutin]], 1892](https://commons.wikimedia.org/wiki/Special:FilePath/First matryoshka museum doll open.jpg?width=200 "Malyutin]], 1892")
![Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).](https://commons.wikimedia.org/wiki/Special:FilePath/Polittico stefaneschi, verso.jpg?width=200 "Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).")
![[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.](https://commons.wikimedia.org/wiki/Special:FilePath/Serpiente alquimica.jpg?width=200 "[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.")
![The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal](https://commons.wikimedia.org/wiki/Special:FilePath/Sierpinski triangle.svg?width=200 "The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal")
![Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.](https://commons.wikimedia.org/wiki/Special:FilePath/Sourdough.jpg?width=200 "Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.")
PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
recursion
PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
[r?'k?:?(?)n]
¦ noun chiefly Mathematics & Linguistics the repeated application of a procedure or rule to successive results of the process.
?a recursive procedure or formula.
recursion
PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
<mathematics, programming> When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
calling itself.
The canonical example of a recursive function is
factorial:
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.
[Jargon File ]
(1996-05-11)
Википедия
Recursion (computer science)
In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.
The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions.
Most computer programming languages support recursion by allowing a function to call itself from within its own code. Some functional programming languages (for instance, Clojure) do not define any looping constructs but rely solely on recursion to repeatedly call code. It is proved in computability theory that these recursive-only languages are Turing complete; this means that they are as powerful (they can be used to solve the same problems) as imperative languages based on control structures such as while and for.
Repeatedly calling a function from within itself may cause the call stack to have a size equal to the sum of the input sizes of all involved calls. It follows that, for problems that can be solved easily by iteration, recursion is generally less efficient, and, for large problems, it is fundamental to use optimization techniques such as tail call optimization.
